First Conference on Fault - Tolerant Systems , IIT Madras , Dec 1995 Combined Preemption Policies in MRSPN

نویسنده

  • Andrea Bobbio
چکیده

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. Some restrictive assumptions should be speci ed in order to arrive to analytically and numerically computable models. The usual assumption is that at most a single non-exponential transition, with associated enabling memory policy, can be enabled in each marking. More recently, new preemption policies have been studied, and closed-form solutions in the Laplace transform domain have been provided. This paper illustrates how to activate di erent preemption policies in MRSPN.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steady State Solution of MRSPN with Mixed Preemption Policies

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. The usual assumption in the implementation of such models is that at most a single non-exponential transition, with associated enabling memory policy, can be enabled in each marking. More recently, new memory policies have been studied in ord...

متن کامل

Steady State Solution of Mrspn with Mixed Preemption Policies Mikll Os Telek

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. The usual assumption in the implementation of such models is that at most a single non-exponential transition, with associated enabling memory policy, can be enabled in each marking. More recently, new memory policies have been studied in ord...

متن کامل

Preemptive repeat identical transitions in Markov regenerative stochastic Petri nets

The recent literature on Markov Regenerative Stochastic Petri Nets (MRSPN) assumes that the random ring time associated to each transition is resampled each time the transition res or is disabled by the ring of a competitive transition. This modeling assumption does not cover the case of preemption mechanisms of repeat identical nature (pri). In this policy, an interrupted job must be repeated ...

متن کامل

Steady State Solution of MRSPN with Mixed Preemption

Markov Regenerative Stochastic Petri Nets (MR-SPN) have been recently recognized as a valuable tool to model systems with non-exponential timed activities. The usual assumption in the implementation of such models is that at most a single non-exponential transition , with associated enabling memory policy, can be enabled in each marking. More recently, new memory policies have been studied in o...

متن کامل

A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs

ÐPetri nets represent a useful tool for performance, dependability, and performability analysis of complex systems. Their modeling power can be increased even more if nonexponentially distributed events are considered. However, the inclusion of nonexponential distributions destroys the memoryless property and requires to specify how the marking process is conditioned upon its past history. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995